Fast example-based surface texture synthesis via discrete optimization
نویسندگان
چکیده
منابع مشابه
Texture Synthesis for Perspective Example
Before the final report, I gives a report about some progress after the presentation on November 20th. The first part is to optimize current algorithm’s time and space complexity. I am rewriting the KD-tree data structure used in patch match process. There are two main differences. First, in previous KD-tree implementation, dim-n vectors are stored in the KD-tree locally, which makes the space ...
متن کاملDiscrete Element Texture Synthesis
1 A variety of natural and man-made phenomena can be characterized 2 by repetitive discrete elements. Examples include a stack of fruits, 3 a plate of dish, or a stone sculpture. Although certain results can 4 be produced via existing methods based on procedural or physical 5 simulation, these are often designed for specific applications. Some 6 of these methods can also be hard to control. 7 W...
متن کاملExample-Based Optimization of Surface-Generation Tables
A method is given that \inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to perform \functor merging" much in the same way as an LR parser performs preex merging. This is an improvement on the semantic-head-driven generator that results...
متن کاملAn Improved SOM Based Surface Texture Synthesis
This paper proposed a new method for surface texture synthesis using improved selforganizing maps as the synthesis logic. The method will first loop map the sample image to the target surface until the surface is full filled, then construct a improved selforganizing maps model, in which use sample image as the input level and the target three-dimensional surface as out put level, to adjust the ...
متن کاملMulti-Constrained Optimization for Example-Based Synthesis
Table 1 in the paper presents related content generation approaches based on graph search, constraint graph search and dynamic programming. Column resource constraints/type denotes the number of resource constraints the algorithm can handle. Type refers to the demand, how a constraint might be satis ed/achieved. If a constraint needs to be satis ed exact, then it is referred to an equality cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Visual Computer
سال: 2006
ISSN: 0178-2789,1432-2315
DOI: 10.1007/s00371-006-0078-3